Two Phase Locking-Based Algorithm with Partial Abort for Firm Deadline Real-Time Database Systems

Locking-based concurrency control algorithms are often proposed as an alternative to optimistic algorithms for real-time database systems. Many of them suffer from the costs of transaction restarts, usually having influence on the system performance. We propose a new method called partial abort aimed to minimize the costs of restarts by saving the part of previously performed work, which is independent of conflicting data. The modification of well known 2PL-HP algorithm is presented. Through simulation experiments we evaluate the performance of the modified version, and show that the improvement is significant.